Helper locks for fork-join parallel programming
نویسندگان
چکیده
منابع مشابه
Fork-join Queue Modeling and Optimal Scheduling in Parallel Programming Frameworks
MapReduce framework is widely used to parallelize batch jobs since it exploits a high degree of multi-tasking to process them. However, it has been observed that when the number of servers increases, the map phase can take much longer than expected. This thesis analytically shows that the stochastic behavior of the servers has a negative effect on the completion time of a MapReduce job, and con...
متن کاملGeneralized parallel-server fork-join queues with dynamic task scheduling
This paper introduces a generalization of the classical parallel-server fork-join queueing system in which arriving customers fork into multiple tasks, every task is uniquely assigned to one of the set of single-server queues, and each task consists of multiple iterations of different stages of execution, including task vacations and communication among sibling tasks. Several classes of dynamic...
متن کاملPerfect Sampling for Fork-Join networks
In this paper, we show how to design a perfect simulation for Markovian fork-join networks, or equivalently, free-choice Petri nets. For pure fork-join networks and for event graphs, the simulation time can be greatly reduced by using extremal initial states, namely blocking states, although such nets do not exhibit any natural monotonicity property. Another approach for perfect simulation of p...
متن کاملFork-Join Program Response Time on Multiprocessors with Exchangeable Join
A Fork-Join program is one that consist of k ≥ 1 parallel tasks, which is a reasonable model for a large number of computing applications. When the parallel processor have multi-channels, later arrived tasks may finish executions earlier than the early arrived tasks and may join with the finished tasks from different programs. This phenomenon introduce correlation to tasks service times and is ...
متن کاملTowards Holistic Analysis for Fork-Join Parallel/Distributed Real-Time Tasks
Parallel/distributed processing is a solution for providing scaling computing power for computational-intensive applications. Parallel/distributed applications are commonly based on the fork-join model, where precedence constraints have to be considered on the development of an adequate timing analysis. Moreover, as the main difference with multicore architectures, distributed systems entail th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2010
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1837853.1693487